An experimental investigation of supersonic flow past a wedge-cylinder configuration

An experimental investigation of supersonic flow past double-wedge configurations was conducted. Over the range of geometries tested, it was found that, while theoretical solutions both for a Type V pattern and for a Type VI pattern could be generated for a particular flow condition (as defined by the geometry and the free-stream conditions), the weaker, Type VI pattern was observed experimentally. More rigorous flow-field solutions were developed for the flow along the wing leading-edge. Solutions were developed for the three-dimensional flow in the plane of symmetry of a swept cylinder (which represented the wing leading-edge) which was mounted on a wedge (which generated the "bow" shock wave). A numerical code was developed using integral techniques to calculate the flow in the shock layer upstream of the interaction region (i.e., near the wing root). Heat transfer rates were calculated for various free stream conditions. The present investigation was undertaken to examine the effects of crossflow on the resultant flow-field and to verify the flow model used in theoretical calculations

Irreducible triangulations of surfaces with boundary

A triangulation of a surface is irreducible if no edge can be contracted to produce a triangulation of the same surface. In this paper, we investigate irreducible triangulations of surfaces with boundary. We prove that the number of vertices of an irreducible triangulation of a (possibly non-orientable) surface of genus g>=0 with b>=0 boundaries is O(g+b). So far, the result was known only for surfaces without boundary (b=0). While our technique yields a worse constant in the O(.) notation, the present proof is elementary, and simpler than the previous ones in the case of surfaces without boundary

Untangling polygons and graphs

Untangling is a process in which some vertices of a planar graph are moved to obtain a straight-line plane drawing. The aim is to move as few vertices as possible. We present an algorithm that untangles the cycle graph C_n while keeping at least \Omega(n^{2/3}) vertices fixed. For any graph G, we also present an upper bound on the number of fixed vertices in the worst case. The bound is a function of the number of vertices, maximum degree and diameter of G. One of its consequences is the upper bound O((n log n)^{2/3}) for all 3-vertex-connected planar graphs.Comment: 11 pages, 3 figure

A Prospective Analysis of Pharmacists Integration in the Patient-Centered Medical Home: Preparing for Value-Based Care

This is an unpublished manuscript of research completed in several patient centered medical homes that provide pharmacy services; presented at the 2016 American Pharmacists Association annual meeting in Baltimore, MD.Objective: The purpose of this project was to describe pharmacy services in a patient-centered medical home to demonstrate pharmacists’ involvement in the evolving delivery of primary care. Design: This was a prospective, qualitative study. Setting and Participants: This project analyzed the work of eight pharmacists employed at a National Committee for Quality Assurance tier III patient-centered medical home associated with a large, academic medical center. Outcome Measures: The primary outcome was to identify and quantify the types of services completed by pharmacists in a patient-centered medical home. Secondary outcomes included determining the percentage of pharmacist recommendations accepted by providers and patients, the percentage of pharmacist interventions submitted for third-party reimbursement, and the average time spent per encounter. Results: Eight pharmacists (representing 4.0 full-time equivalents) facilitated 581 encounters over 20 days. Mean time spent per encounter was 20 minutes (± 19). The most common types of encounters were interdisciplinary visits (31.8%) and phone/secure portal communication (30.0%). Of 918 pharmacist recommendations made to providers, 830 (90.4%) were accepted and implemented. Of 412 pharmacist recommendations made to patients, 393 (95.4%) were verbally accepted. Thirty-nine percent of encounters were eligible for direct payor billing. Conclusion: Our data show that pharmacists working in a patient-centered medical home are effectively integrated within the evolving delivery of primary care. Consistent inclusion of pharmacy services should be readily supported in future models of health care reform

The lower and upper bound problems for cubical polytopes

We construct a family of cubical polytypes which shows that the upper bound on the number of facets of a cubical polytope (given a fixed number of vertices) is higher than previously suspected. We also formulate a lower bound conjecture for cubical polytopes.Peer Reviewedhttp://deepblue.lib.umich.edu/bitstream/2027.42/41359/1/454_2005_Article_BF02189315.pd

Review: The Journal of Dramaturgy, volume 22, issue 2

Contents include: Editor\u27s Note; Elliott Hayes Award Acceptance Speech From Denver to Gulu, With Thanks to Lynn Nottage; Learning to Speak American: A Writer\u27s Journey, Keynote Remarks Delivered at the Annual Conference of the Literary Managers and Dramturgs of the Americas, Alliance Theatre, Atlanta, GA June 28, 2012; Michael Mark Chemers\u27 Ghost Light: An Introductory Handbook for Dramaturgy; Creative Process in Theatrical Translation: An Interview with Adam Versenyi; Croisades in Quebec: On the Semiotics of Contemporary French Dramaturgie. Issue editors: Sydney Cheek-O\u27Donnell, Debra Cardona, Janine Sobeckhttps://soundideas.pugetsound.edu/lmdareview/1044/thumbnail.jp

Polytopality and Cartesian products of graphs

We study the question of polytopality of graphs: when is a given graph the graph of a polytope? We first review the known necessary conditions for a graph to be polytopal, and we provide several families of graphs which satisfy all these conditions, but which nonetheless are not graphs of polytopes. Our main contribution concerns the polytopality of Cartesian products of non-polytopal graphs. On the one hand, we show that products of simple polytopes are the only simple polytopes whose graph is a product. On the other hand, we provide a general method to construct (non-simple) polytopal products whose factors are not polytopal.Comment: 21 pages, 10 figure

A new scale to measure family members' perception of community health care services for persons with Huntington disease

Huntington Disease (HD) is a progressive genetic brain disease leading to disruptive cognitive, behavioral, and physical impairments. Persons with the condition and their caregivers need appropriate and accessible health care services to help them manage the disease adequately. The purpose of this study was to evaluate the psychometric properties of a new scale that measures family members' perception of community health care services (CHCS) for persons with HD